Complexity of splits reconstruction for low-degree trees
نویسندگان
چکیده
منابع مشابه
Complexity of Splits Reconstruction for Low-Degree Trees
Given a vertex-weighted tree T , the split of an edge xy in T is min{sx(xy), sy(xy)} where su(uv) is the sum of all weights of vertices that are closer to u than to v in T . Given a set of weighted vertices V and a multiset of splits S, we consider the problem of constructing a tree on V whose splits correspond to S. The problem is known to be NP-complete, even when all vertices have unit weigh...
متن کاملLow-Degree Minimum Spanning Trees
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum spanning tree (MST). We prove that under the Lp norm, the maximum vertex degree over all MSTs is equal to the Hadwiger number of the corresponding unit ball; we show an even tighter bound for MSTs where the maximum degree is minimized. We give the best-known bounds for the maximum MST degree for ar...
متن کاملUndecidability Results for Low Complexity Degree Structures
We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in [7]. The method can be applied in fact to all hyper-polynomial time classes.
متن کاملPlane Bichromatic Trees of Low Degree
Let R and B be two disjoint sets of points in the plane such that |B| 6 |R|, and no three points of R ∪ B are collinear. We show that the geometric complete bipartite graph K(R,B) contains a non-crossing spanning tree whose maximum degree is at most max { 3, ⌈ |R|−1 |B| ⌉ + 1 } ; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas et al. a...
متن کاملIterative Low Complexity Factorization for Projective Reconstruction
We present a highly efficient method for estimating the structure and motion from image sequences taken by uncalibrated cameras. The basic principle is to do projective reconstruction first followed by Euclidean upgrading. However, the projective reconstruction step dominates the total computational time, because we need to solve eigenproblems of matrices whose size depends on the number of fra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.08.005